A Pair of Disjoint 3-GDDs of type g^t u^1

Pairwise disjoint 3-GDDs can be used to construct some optimal constant-weight codes. We study the existence of a pair of disjoint 3-GDDs of type $g^t u^1$ and establish that its necessary conditions are also sufficient.Comment: Designs, Codes and Cryptography (to appear

A construction of bent functions from plateaued functions

In this presentation, a technique for constructing bent functions from plateaued functions is introduced and analysed. This generalizes earlier techniques for constructing bent from near-bent functions. Using this construction, we obtain a big variety of inequivalent bent functions, some weakly regular and some non-weakly regular. Classes of bent function with some additional properties that enable the construction of strongly regular graphs are constructed, and explicit expressions for bent functions with maximal degree are presented

The α\alpha-Arboricity of Complete Uniform Hypergraphs

International audience$\alpha$-Acyclicity is an important notion in database theory. The $\alpha$-arboricity of a hypergraph H is the minimum number of $\alpha$-acyclic hypergraphs that partition the edge set of H. The $\alpha$-arboricity of the complete 3-uniform hypergraph is determined completely

Combinatorial coverings from geometries over principal ideal rings

Journal of Combinatorial Designs74247-268JDES

List decoding for binary Goppa codes

This paper presents a Patterson-style list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm corrects, in polynomial time, approximately $n - \sqrt{n(n-2t-2)}$ errors in a length-n classical irreducible degree-t binary Goppa code. Compared to the best previous polynomial-time list-decoding algorithms for the same codes, the new algorithm corrects approximately $t^2/2n$ extra errors

Kalium-argonová metoda vycházející z gama-spektrometrických karotážních dat jako metoda stanovení stáří hornin

Fix positive integers B and w. Let C be a linear code over F 2 of length Bw. The 2-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks, each of which has Hamming weight 0 or 2. This problem appears in attacks on the FSB (fast syndrome-based) hash function and related proposals. This problem differs from the usual information-set-decoding problems in that (1) the target codeword is required to have a very regular structure and (2) the target weight can be rather high, so that there are many possible codewords of that weight. Augot, Finiasz, and Sendrier, in the paper that introduced FSB, presented a variant of information-set decoding tuned for 2-regular decoding. This paper improves the Augot–Finiasz–Sendrier algorithm in a way that is analogous to Stern’s improvement upon basic information-set decoding. The resulting algorithm achieves an exponential speedup over the previous algorithm

Stigma of mental illness.

Singapore Medical Journal423111-11

Properties and applications of cobalt-based material produced by electron-beam-induced deposition

10.1116/1.1481040Journal of Vacuum Science and Technology A: Vacuum, Surfaces and Films2041295-1302JVTA

Orthogonal array design as a chemometric method for the optimization of analytical procedures part 3.* five-level design and its application in a polarographic reaction system for selenium determination

The Analyst1202273-27

Orthogonal array design as a chemometric method for the optimization of analytical procedures part 4.* mixed-level design and its application to the high-performance liquid chromatographic determination of polycyclic aromatic hydrocarbons

The Analyst1202281-28